TOWARDS PLANNING AS CONCURRENCY Ozan Kahramano˘gulları Computer Science Institute, University of Leipzig International Center for Computational Logic, TU Dresden email: ABSTRACT

Source URL: www.wv.inf.tu-dresden.de

Building Verified Language Tools in Operational Type Theory Aaron Stump Computational Logic Center Computer Science Department The University of Iowa

Source URL: www.cis.upenn.edu

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Source URL: www.bedewell.com

• Computational complexity theory
• Logic
• Complexity classes
• Mathematical logic
• PSPACE
• FO
• Second-order logic
• P versus NP problem
• Constraint satisfaction problem
• NP
• P
• Constraint satisfaction

The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University,

Source URL: www.bedewell.com

• Computational complexity theory
• Complexity classes
• Theory of computation
• FO
• PSPACE
• IP
• NP
• P
• Reduction
• Homomorphism
• SO

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

ALGORITHMS FOR SEMI-AUTOMATIC WEB SERVICE COMPOSITION: DATA MEDIATION AND SERVICE SUGGESTION by RUI WANG (Under the Direction of Eileen T. Kraemer and John A. Miller) ABSTRACT

Source URL: mango.ctegd.uga.edu

• Computing
• Web standards
• World Wide Web
• Web services
• Semantic Web
• Algorithm
• Mathematical logic
• Theoretical computer science
• Mediation
• Web Services Description Language
• SAWSDL
• Computational linguistics

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

IFSA Newsletter Vol. 10, No. 3, September 2013 page In this issue: Message from Newsletter Editor –

Source URL: isdlab.ie.ntnu.edu.tw

• Artificial intelligence
• Fuzzy logic
• Academia
• Logic
• Science and technology
• Lotfi A. Zadeh
• Fuzzy set
• Computational intelligence
• Neuro-fuzzy
• Fuzzy control system
• Fuzzy Sets and Systems
• Rough set

Supplementary for Structural-RNN: Deep Learning on Spatio-Temporal Graphs Ashesh Jain1,2 , Amir R. Zamir1 , Silvio Savarese1 , and Ashutosh Saxena3 Stanford University1 , Cornell University2 , Brain Of Things Inc.3 {ashe

Source URL: cvgl.stanford.edu

• Artificial neural networks
• Computational neuroscience
• Academia
• Deep learning
• Long short-term memory
• Mathematical logic
• Science and technology
• Applied mathematics
• Algorithm
• Motion
• Artificial intelligence